#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ed "\n"
void ya3ny_m3ttsr3shy() {
cin.tie(0);
cin.sync_with_stdio(0);
cout.tie(0);
cout.sync_with_stdio(0);
}
bool great(int x,int y){
return x>y;
}
long long power(long long b ,long long p , long long m){
if(!p) return 1;
long long ans = power(b , p/2 , m);
ans *= ans;
ans %= m;
if(p%2) ans *= b , ans %= m;
return ans%m;
}
bool is_prime(int n){
if(n==2) return true;
else if(n==1||n%2==0) return false;
else{
int i;
for(i=3;i*i<=n;i+=2)
if(n%i==0) return false;}
return true;
}
int main() {
ya3ny_m3ttsr3shy();
int x2,num1,num2,xx2;
cin>>x2;
xx2=x2;
for(ll i=2;i*i<=x2;i++){
if(x2%i==0) num1=i;
while(x2%i==0) x2/=i;
}
if(x2>1) num1=x2;
int x1=xx2-num1+1,ans=1e9;
while(x1<=xx2){
int num=x1;
for(ll i=2;i*i<=num;i++){
if(num%i==0) num2=i;
while(num%i==0) num/=i;
}
if(num>1) num2=num;
if(x1!=num2)ans=min(ans,x1-num2+1);
x1++;
}
cout<<ans;
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |